Monte-Carlo Hex

نویسندگان

  • Tristan Cazenave
  • Abdallah Saffidine
چکیده

We present YOPT a program that plays Hex using Monte-Carlo tree search. We describe heuristics that improve simulations and tree search. We also address the combination of Monte-Carlo tree search with virtual connection search.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Utilisation de la recherche arborescente Monte-Carlo au Hex

RÉSUMÉ. Nous présentons YOPT, un programme qui joue au Hex en utilisant des techniques de Monte-Carlo. Nous décrivons des heuristiques pour améliorer les simulations et les descentes d’arbre Monte-Carlo. Nous abordons aussi l’utilisation d’heuristiques pour améliorer la parallélisation du programme. Le niveau de YOPT atteint le niveau de SIX pour les temps utilisés en compétition. ABSTRACT. We ...

متن کامل

Artificial Intelligence for Bidding Hex

We present a Monte Carlo algorithm for efficiently finding near optimal moves and bids in the game of Bidding Hex. The algorithm is based on the recent solution of Random-Turn Hex by Peres, Schramm, Sheffield, and Wilson together with Richman’s work connecting random-turn games to bidding games.

متن کامل

Artificial intelligence for Bidding Hex

We present a Monte Carlo algorithm for efficiently finding near optimal moves and bids in the game of Bidding Hex. The algorithm is based on the recent solution of Random-Turn Hex by Peres, Schramm, Sheffield, and Wilson together with Richman’s work connecting random-turn games to bidding games.

متن کامل

Bias in Monte Carlo Simulations Due To Pseudo-Random Number Generator Initial Seed Selection

Pseudo-random number generators can bias Monte Carlo simulations of the standard normal probability distribution function with initial seeds selection. Five generator designs were initial-seeded with values from 10000 HEX to 1FFFF HEX , estimates of the mean were calculated for each seed, the distribution of mean estimates was determined for each generator and simulation histories were graphed ...

متن کامل

MoHex 2.0: A Pattern-Based MCTS Hex Player

In recent years the Monte Carlo tree search revolution has spread from computer Go to many areas, including computer Hex. MCTS Hex players now outperform traditional knowledge-based alpha-beta search players, and the reigning Computer Olympiad Hex gold medallist is the MCTS player MoHex. In this paper we show how to strengthen MoHex, and observe that — as in computer Go — using learned patterns...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009